preemptive scheduling造句
例句與造句
- 1 worker is running with preemptive scheduling
1 =正在以搶先計劃運行工作線程。 - What is the difference between preemptive scheduling and time slicing
搶先調(diào)度與分時調(diào)度有何不同？ - Any worker that is running external code is run under preemptive scheduling
任何運行外部代碼的工作線程都運行在搶先計劃之下。 - Some tasks , such as network listeners , run under preemptive scheduling
某些任務(wù)（例如，空閑工作線程和網(wǎng)絡(luò)偵聽器）在搶先計劃下運行。 - Under preemptive scheduling , the highest priority task executes until it enters the waiting or dead states or a higher priority task comes into existence
采用搶先調(diào)度方式時，具有最高優(yōu)先級的任務(wù)先執(zhí)行直到它進(jìn)入等待或僵死狀態(tài)，或者是有更高優(yōu)先級的任務(wù)產(chǎn)生。 - It's difficult to find preemptive scheduling in a sentence. 用preemptive scheduling造句挺難的
- A ： under preemptive scheduling , the highest priority task executes until it enters the waiting or dead states or a higher priority task comes into existence
采用搶先調(diào)度方式時，具有最高優(yōu)先級的任務(wù)先執(zhí)行直到它進(jìn)入等待或僵死狀態(tài)，或者是有更高優(yōu)先級的任務(wù)產(chǎn)生。 - First we give some notations : where r lti : the load of the machine at step t ( i . e . , immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; … , jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1 , … , pn , there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3 . 2 . 1 ) the algorithm will schedule jobs in such a way that , at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3 . 2 . 1 ) step 2 research the following reserved intervals
需加工n個工件人； … ；人，每個工件是在線到達(dá)（ oneb ， olle ）且可打斷的，機器人人的準(zhǔn)備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準(zhǔn)備時間的平行機在線排序問題。它是帶機器準(zhǔn)備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應(yīng)用背景。這里工件在線到達(dá)（ onebyone ）指的是工件的情況并不是提前知道的，只有將工件jj人安排完以后我們才能知道工jj的一些情況p工件的加工時間p 。